Lattice bijections for string modules, snake graphs and the weak Bruhat order

In this paper we introduce abstract string modules and give an explicit bijection between the submodule lattice of module perfect matching corresponding snake graph. particular, make direct correspondence a For every define Coxeter element in symmetric group. We then establish given by interval weak Bruhat order determined element. Using graphs, new concise formulation graph calculus.